Optimal Insertion of a Segment Highway in a City Metric

نویسندگان

  • Matias Korman
  • Takeshi Tokuyama
چکیده

Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (where the city distance is measured with speed v > 1 on a highway and 1 in the underlying metric elsewhere). Extending the results of Ahn et al. ([7]), we consider the option that there are already some built highways. We give a unified approach to this problem to design polynomial-time algorithms for several combinations of objective functions and types of the inserted highway (turnpike or freeway).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Algorithm for Inserting a Highway in a City Metric Based on Minimization of Quasiconvex Functions

We introduce an improved algorithm to locate a segment highway such that the maximum city distance between a given set of n points is minimized (where the city distance is measured with speed v > 1 on a highway and 1 in the underlying metric elsewhere). We consider that such highway is built in a complex transportation system with H other highways and obstacles. The algorithm runs in O(nH(log n...

متن کامل

Constructing Optimal Highways

For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed v on h and with speed 1 in the underlying metric elsewhere. Given a set S of n points in the plane and a highway speed v, we co...

متن کامل

ar X iv : c s . C G / 0 70 30 37 v 1 8 M ar 2 00 7 Constructing Optimal Highways ∗

For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed v on h and with speed 1 in the underlying metric elsewhere. Given a set S of n points in the plane and a highway speed v, we co...

متن کامل

Evaluation of Methods for Computing Free-Flow Speed and Its ‎Significance in the HCM 2010; Case Study: A Ramp-Weaving Segment

The core methodology of the Highway Capacity Manual (HCM) 2010 for freeway analyses is based on Free-Flow Speed (FFS). Moreover, weaving segments are major elements of freeway facilities that form where two one-way traffic streams intersect by merging and diverging maneuvers. Hence, this study used three different methods to compute FFS of a ramp-weaving segment, and then employed the proposed ...

متن کامل

Geometric Modeling of Dubins Airplane Movement and its Metric

The time-optimal trajectory for an airplane from some starting point to some final point is studied by many authors. Here, we consider the extension of robot planer motion of Dubins model in three dimensional spaces. In this model, the system has independent bounded control over both the altitude velocity and the turning rate of airplane movement in a non-obstacle space. Here, in this paper a g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008